منابع مشابه
A Lattice Spanning-tree Entropy Function
The function W (a, b) = 2π 0 dx 2π 0 dy ln[1−a cos x−b cos y−(1−a−b) cos(x+y)] which expresses the spanning-tree entropy for various two dimensional lattices, for example, is evaluated directly in terms of standard functions. It is applied to derive several limiting values of the Triangular lattice Green function.
متن کاملThe Minimum Spanning Tree of Maximum Entropy
In computer vision, we have the problem of creating graphs out of unstructured point-sets, i.e. the data graph. A common approach for this problem consists of building a triangulation which might not always lead to the best solution. Small changes in the location of the points might generate graphs with unstable configurations and the topology of the graph could change significantly. After buil...
متن کاملCHOOSING A SPANNING TREE FOR THE INTEGER LATTICE UNIFORMLY Running Head: RANDOM SPANNING TREES
Consider the nearest neighbor graph for the integer lattice Z in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees. As the piece gets larger, this approaches a limiting measure on the set of spanning graphs for Z. This is shown to be a tree if and only if d ≤ 4. In this case, the tree has...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA Lattice - Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm ( Extended
Highly-optimized concurrent algorithms are often hard to prove correct because they have no natural decomposition into separately provable parts. This paper presents a proof technique for the modular verification of such non-modular algorithms. It generalizes existing verification techniques based on a totally-ordered hierarchy of refinements to allow a partiallyordered hierarchy-that is: a lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2005
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/38/25/l02